Optimizing Web Server's Data Transfer with Hotlinks
نویسندگان
چکیده
We study the optimization of the expected number of bytes that must be transferred by a Web server when a user visits one of its pages. Given a Web site, we want to find an assignment of hotlinks (shortcuts) that minimizes the expected data transfer, i.e., the average amount of bytes to be downloaded in order to reach one of its pages. We propose an optimization algorithm and perform simulations in real and random Web sites. The simulations reveal that the average data transfer can be reduced by at least 11% and as much as 30%.
منابع مشابه
Hotlink Enhancement Algorithms for Web Directories
This paper proposes an approach for reducing the search effort of a user possessing limited a-priori information, in data arranged hierarchically such as in Yahoo or the Open Directory Project. Consider a web site containing a collection of web pages with data. Each page is associated with a weight representing the frequency that page is accessed by users. In the tree hierarchy representation, ...
متن کاملApproximation Algorithm for Hotlink Assignment in the Greedy Model
Link-based information structures such as the web can be enhanced through the addition of hotlinks. Assume that each node in the information structure is associated with a weight representing the access frequency of the node by users. In order to access a particular node, the user must follow a path leading to it from the root. By adding new hotlinks to the tree, it may be possible to reduce th...
متن کاملHeuristic Connection Management for Improving Server-Side Performance on the Web
HTTP/1.1 standard reduces latencies and overhead from closing and re-establishing connections by supporting persistent connections as a default, which encourage multiple transfers of objects over one connection. HTTP/1.1, however, does not define explicitly connection-closing time but specifies a certain fixed holding time model. This model may induce wasting server's resource when server maint...
متن کاملStrategies for Hotlink Assignments
Consider a DAG (directed acyclic graph) G = (V; E) representing a collection V of web pages connected via links E. All web pages can be reached from a designated source page, represented by a source node s of G. Each web page carries a weight representative of the frequency with which it is visited. By adding hotlinks, at most one per page, we are interested in minimizing the expected number of...
متن کاملOptimizing Membership Functions using Learning Automata for Fuzzy Association Rule Mining
The Transactions in web data often consist of quantitative data, suggesting that fuzzy set theory can be used to represent such data. The time spent by users on each web page is one type of web data, was regarded as a trapezoidal membership function (TMF) and can be used to evaluate user browsing behavior. The quality of mining fuzzy association rules depends on membership functions and since t...
متن کامل